Semantics for finite delay

A Fully abstract presheaf semantics for SCCS with finite delay

We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. This can be viewed as a first step in representing fairness in presheaf semantics. ...

A Fully Abstract Presheaf Semantics of SCCS with Finite Delay

We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. This can be viewed as a first step in representing fairness in presheaf semantics. ...

Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay

Categorical Models for Fairness and a Fully Abstract Presheaf Semantics of SCCS with Finite Delay?

We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. This can be viewed as a first step in representing fairness in presheaf semantics. ...

Finite state intensional semantics

Suppose possible worlds are strings, rather than physically structured worlds like ours. Then the proposition corresponding to a sentence or a formula in logical language is a set of strings; an epistemic acquaintance relation is a relation between strings; and in a relational construction of partition semantics for questions, a question meaning is a relation between strings. If discourse refer...